An Efficient Algorithm for Constructing DNA Boolean Circuit
نویسنده
چکیده
Computation using biological Deoxyribonucleic acid (DNA) strand is increasingly found to be a viable proposition. A unique generalized efficient algorithm for forming any Boolean circuit strand is proposed in this paper. The implementation of the Boolean circuit using the proposed algorithm is also presented. This Boolean circuit requires only one kind of bio-operation at each level. Further, this paper adopts a uniform representation for logical 0 and 1 for all Boolean circuit. Simulation to validate the efficient algorithm is also presented in this work.
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملDNA-Based Self-Propagating Algorithm for Solving Bounded-Fan-In Boolean Circuits
This paper proposes a method for simulating Boolean circuits based on primer extension and DNA cleavage. The advantage of the current method is the requirement of little human intervention during the course of simulation. The paper also explores the potential of RecA-assisted DNA-DNA hybridization in DNA-based computation. The method could in principle allow simulation of many levels of large B...
متن کامل29 Np-hard Problems 29.1 'efficient' Problems
A generally-accepted minimum requirement for an algorithm to be considered ‘efficient’ is that its running time is polynomial: O(nc) for some constant c, where n is the size of the input.1 Researchers recognized early on that not all problems can be solved this quickly, but we had a hard time figuring out exactly which ones could and which ones couldn’t. there are several so-called NP-hard prob...
متن کاملA DNA-Based Simulation Model for Bounded Fan-in Boolean Circuits
DNA computing has recently gained intensive attention as an emerging field bridging the gap between computer science and biomolecular science. DNA based computing can be competitively used to simulate various computing models including Boolean circuits because of its potential to offer massive parallelism. In this paper we present a new DNA-based evaluation algorithm for a bounded fan-in circui...
متن کاملIkenmeyer C, Komarath B, Lenzen C, Lysikov V, Mokhov A, Sreenivasaiah K.
The problem of constructing hazard-free Boolean circuits dates back to the 1940s and is an important problem in circuit design. Our main lower-bound result unconditionally shows the existence of functions whose circuit complexity is polynomially bounded while every hazardfree implementation is provably of exponential size. Previous lower bounds on the hazard-free complexity were only valid for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010